Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
231	Crossing Number is Hard for Cubic Graphs? Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University of Ostrava, Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2005-02-11 15:57:54 Inequalities Minor Cubic graph Neighbourhood Planar graph Graph Path decomposition Petersen graph Graph theory Topological graph theory Crossing number
232	CCCG 2011, Toronto ON, August 10–12, 2011 A Note on Minimum-Segment Drawings of Planar Graphs Stephane Durocher ∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Geometric graph theory Outerplanar graph Graph drawing Graph coloring Tree Graph Minimum spanning tree Path decomposition Angular resolution Graph theory Planar graphs Topological graph theory
233	Structural Decomposition Methods and What They are Good For Markus Aschinger1 , Conrad Drescher1 , Georg Gottlob1,2 , Peter Jeavons1 , and Evgenĳ Thorstensen1 1 Computing Laboratory, University of Oxford 2 Oxford Man In Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:11 Graph operations Tree decomposition Decomposition method Path decomposition Parameterized complexity Constraint satisfaction problem Bipartite graph Hypertree Hypergraph Graph theory Theoretical computer science Constraint programming
234	Distributed Computing FS 2013 Prof. R. Wattenhofer Michael K¨onig Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics NP-complete problems Hamiltonian path Connectivity Distributed hash table Graph theory Theoretical computer science Distributed data storage
235	ICS 260 – Fall 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:38 Complexity classes NP-complete problems Mathematical optimization Operations research Travelling salesman problem NP Induced path Independent set Directed acyclic graph Theoretical computer science Graph theory Computational complexity theory
236	An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT Add to Reading List Source URL: xmailserver.org Language: English - Date: 2007-02-16 03:04:45 Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory
237	Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface∗ ´ COLIN DE VERDIERE ` Eric Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2007-08-01 04:08:14 Homotopy theory Algebraic topology Topological graph theory Graph connectivity Homotopy Covering space Path Differential geometry of surfaces Graph Graph theory Topology Mathematics
238	CCCG 2011, Toronto ON, August 10–12, 2011 A Note on Minimum-Segment Drawings of Planar Graphs Stephane Durocher ∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Geometric graph theory Outerplanar graph Graph drawing Graph coloring Tree Graph Minimum spanning tree Path decomposition Angular resolution Graph theory Planar graphs Topological graph theory
239	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science
240	Distance Preserving Terrain Simplification — An Experimental Study Boaz Ben-Moshe1 Matthew J. Katz2 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:06 Geometry Delaunay triangulation Distance Geometric spanner Geodesic Shortest path problem Mathematics Triangulation Graph theory